Hybrid Metaheuristics for the Unrelated Parallel Machine Scheduling to Minimize Makespan and Maximum Just-in-Time Deviations
نویسندگان
چکیده
منابع مشابه
Hybrid Metaheuristics for the Unrelated Parallel Machine Scheduling to Minimize Makespan and Maximum Just-in-Time Deviations
This paper studies the unrelated parallel machine scheduling problem with three minimization objectives – makespan, maximum earliness, and maximum tardiness (METUPMSP). The last two objectives combined are related to just-intime (JIT) performance of a solution. Three hybrid algorithms are presented to solve the MET-UPMSP: reactive GRASP with path relinking, dual-archived memetic algorithm (DAMA...
متن کاملA Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
متن کاملArchived Simulated Annealing for Unrelated Parallel Machine Scheduling to Minimize Fuzzy Makespan and Tardiness
The research proposes a two-phase matching-based decoding scheme that will be incorporated into bi-objective simulated annealing (SA) to solve unrelated parallel machine scheduling problems (UPMSP). The two objectives are to maximize the satisfactions of makespan and average tardiness, in terms of fuzzy measure. The effectiveness of the decoding scheme is investigated using four simulated annea...
متن کاملEfficient Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Unrelated Parallel Machines
This paper discusses an efficient heuristic to minimize the makespan of scheduling n independent jobs on m unrelated parallel machines. The problem of scheduling the jobs on the unrelated parallel machines is combinatorial in nature. Hence, the heuristic approach is inevitable for quicker solution. In this paper, a simple and efficient heuristic is designed to minimize the makespan of schedulin...
متن کاملScheduling parallel jobs to minimize the makespan
We consider the NP-hard problem of scheduling parallel jobs with release dates on identical parallel machines to minimize the makespan. A parallel job requires simultaneously a prespecified, job-dependent number of machines when being processed. We prove that the makespan of any nonpreemptive list-schedule is within a factor of 2 of the optimal preemptive makespan. This gives the best-known app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Research in Artificial Intelligence
سال: 2012
ISSN: 2165-4069,2165-4050
DOI: 10.14569/ijarai.2012.010302